Implementing Quantum Search Algorithm with Metamaterials

Fixed Phase Quantum Search Algorithm

Building quantum devices using fixed operators is a must to simplify the hardware construction. Quantum search engine is not an exception. In this paper, a fixed phase quantum search algorithm will be presented. Selecting phase shifts of 1.825π in the standard amplitude amplification will make the technique perform better so as to get probability of success at least 98% in O ( √

Quantum Search Algorithm with more Reliable Behaviour using Partial Diffusion

In this paper, we will use a quantum operator which performs the inversion about the mean operation only on a subspace of the system (Partial Diffusion Operator) to propose a quantum search algorithm runs in O( √ N/M ) for searching unstructured list of size N with M matches such that, 1 ≤ M ≤ N . We will show that the performance of the algorithm is more reliable than known quantum search algo...

A Fixed-Phase Quantum Search Algorithm with More Flexible Behavior

When the Grover’s algorithm is applied to search an unordered database, the probability of success usually decreases with the increase of marked items. To address this phenomenon, a fixed-phase quantum search algorithm with more flexible behavior is proposed. In proposed algorithm, the phase shifts can be fixed at the different values to meet the needs of different practical problems. If resear...

Implementing a Node Based Split-Tree Search Algorithm

Grover’s Search Algorithm and Quantum Lower Bounds

Searching an item in an unsorted database with size N costs a classical computer O(N) running time. Can a quantum computer search a needle in a haystack much more efficient than its classical counterpart? Grover, in 1996, affirmatively answered this question by proposing a search algorithm [4], which consults the database only O( N ) times. In contrast to algorithms based on the quantum Fourier...